Representation Theorems for Hypergraph Satisfiability
نویسنده
چکیده
Given a set of propositions, one can consider its inconsistency hypergraph. Then the satisfiability of sets of clauses with respect to that hypergraph (see [1], [6]) turns out to be the usual satisfiability. The problem is which hypergraphs can be obtained from sets of formulas as inconsistency hypergraphs. In the present paper it is shown that this can be done for all hypergraphs with countably many vertices and pairwise incomparable edges. Then, a general method of transforming the combinatorial problems into the satisfiability problem is shown.
منابع مشابه
Representation Theorem for Hypergraph Satisfiability
Given a set of propositions, one can consider its inconsistency hypergraph. Then the safisfiability of sets of clauses with respect to that hypergraph (see [2], [4]) turns out to be the usual satisfiability. The problem is which hypergraphs can be obtained from sets of formulas as inconsistency hypergraphs. In the present paper it is shown that this can be done for all hypergraphs with countabl...
متن کاملCombining Two Local Search Approaches to Hypergraph Partitioning
We study leading-edge local search heuristics for balanced hypergraph partitioning and Boolean satisfiability, intending the generalization of such heuristics beyond their original domains. We adapt the Fiduccia Mattheyses (FM) hypergraph partitioning heuristic to Boolean Satisfiability (SAT), and the WalkSAT SAT solver to hypergraph partitioning. Focusing on balanced hypergraph partitioning, w...
متن کاملConsequence Operations Based on Hypergraph Satisfiability
Four consequence operators based on hypergraph satisfiability are defined. Their properties are explored and interconnections are displayed. Finally their relation to the case of the Classical Propositional Calculus is shown. 1. Preliminaries. Let us recall some definitions and facts which can also be found in Cowen [1,2] and Kolany [3]. A hypergraph is a structure G = (V, E), where V is a set ...
متن کاملThe Grötzsch Theorems for the Hypergraph of Maximal Cliques
In this paper, we extend the Grötzsch Theorem by proving that the clique hypergraph H(G) of every planar graph is 3-colorable. We also extend this result to list colorings by proving that H(G) is 4-choosable for every planar or projective planar graph G. Finally, 4-choosability of H(G) is established for the class of locally planar graphs on arbitrary surfaces.
متن کاملON THE NORMALITY OF t-CAYLEY HYPERGRAPHS OF ABELIAN GROUPS
A t-Cayley hypergraph X = t-Cay(G; S) is called normal for a finite group G, if the right regular representationR(G) of G is normal in the full automorphism group Aut(X) of X. In this paper, we investigate the normality of t-Cayley hypergraphs of abelian groups, where S < 4.
متن کامل